Deterministic Construction of Compressed Sensing Measurement Matrix with Arbitrary Sizes via QC-LDPC and Arithmetic Sequence Sets
نویسندگان
چکیده
It is of great significance to construct deterministic measurement matrices with good practical characteristics in Compressed Sensing (CS), including reconstruction performance, low memory cost and computing resources. Low-density-parity check (LDPC) codes CS can be closely related. This paper presents a method constructing compressed sensing based on quasi-cyclic (QC) LDPC arithmetic sequence sets. The cyclic shift factor each submatrix QC-LDPC determined by Compared random matrices, the proposed has advantages because it generated matrix, which requires less storage lower Because restricted isometric property (RIP) difficult verify, mutual coherence girth are used as computationally tractable indicators evaluate matrix performance. several typical minimum superior capability signal according one-dimensional (1D) signals two-dimensional (2D) image simulation results. When sampling rate 0.2, maximum (minimum) gain peak signal-to-noise ratio (PSNR) structural similarity index (SSIM) up 2.89 dB (0.33 dB) 0.031 (0.016) while using 10 test images. Meanwhile, time reduced nearly half.
منابع مشابه
A new method on deterministic construction of the measurement matrix in compressed sensing
Construction on the measurement matrix A is a central problem in compressed sensing. Although using random matrices is proven optimal and successful in both theory and applications. A deterministic construction on the measurement matrix is still very important and interesting. In fact, it is still an open problem proposed by T. Tao. In this paper, we shall provide a new deterministic constructi...
متن کاملA Structured Construction of Optimal Measurement Matrix for Noiseless Compressed Sensing via Analog Polarization
Abstract—In this paper, we propose a method of structured construction of the optimal measurement matrix for noiseless compressed sensing (CS), which achieves the minimum number of measurements which only needs to be as large as the sparsity of the signal itself to be recovered to guarantee almost error-free recovery, for sufficiently large dimension. To arrive at the results, we employ a dua...
متن کاملCompressed Sensing of Memoryless Sources: A Deterministic Hadamard Construction
Compressed sensing is a new trend in signal processing for efficient data sampling and signal acquisition. The idea is that most real-world signals have a sparse representation in an appropriate basis and this can be exploited to capture the sparse signal by taking a few linear projections. The recovery is possible by running appropriate low-complexity algorithms that exploit the sparsity (prio...
متن کاملDeterministic Construction of Compressed Sensing Matrices using BCH Codes
In this paper we introduce deterministic m×n RIP fulfilling ±1 matrices of order k such that log m log k ≈ log(log2 n) log(log2 k) . The columns of these matrices are binary BCH code vectors that their zeros are replaced with −1 (excluding the normalization factor). The samples obtained by these matrices can be easily converted to the original sparse signal; more precisely, for the noiseless sa...
متن کاملThe Chaotic Measurement Matrix for Compressed Sensing
How to construct a measurement matrix with good performance and easy hardware implementation is the core research problem in compressed sensing. In this paper, we present a simple and efficient measurement matrix named Incoherence Rotated Chaotic (IRC) matrix. We take advantage of the well pseudorandom of chaotic sequence, introduce the concept of the incoherence factor and rotation, and adopt ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2023
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics12092063